Effective representation of RT-LOTOS terms by finite time petri nets

The paper describes a transformational approach for the specification and formal verification of concurrent and real-time systems. At upper level, one system is specified using the timed process algebra RT-LOTOS. The output of the proposed transformation is a Time Petri net (TPN). The paper particularly shows how a TPN can be automatically constructed from an RT-LOTOS specification using a compositionally defined mapping. The proof of the translation consistency is sketched in the paper and developed in [1]. The RT-LOTOS to TPN translation patterns formalized in the paper are being implemented. in a prototype tool. This enables reusing TPNs verification techniques and tools for the profit of RT-LOTOS

Graphical Encoding of a Spatial Logic for the pi-Calculus

This paper extends our graph-based approach to the verification of spatial properties of π-calculus specifications. The mechanism is based on an encoding for mobile calculi where each process is mapped into a graph (with interfaces) such that the denotation is fully abstract with respect to the usual structural congruence, i.e., two processes are equivalent exactly when the corresponding encodings yield isomorphic graphs. Behavioral and structural properties of π-calculus processes expressed in a spatial logic can then be verified on the graphical encoding of a process rather than on its textual representation. In this paper we introduce a modal logic for graphs and define a translation of spatial formulae such that a process verifies a spatial formula exactly when its graphical representation verifies the translated modal graph formula

Resolving Non-Determinism in Choreographies

Resolving non-deterministic choices of choreographies is a crucial task. We introduce a novel notion of realisability for choreographies –called whole-spectrum implementation– that rules out deterministic implementations of roles that, no matter which context they are placed in, will never follow one of the branches of a non-deterministic choice. We show that, under some conditions, it is decidable whether an implementation is whole-spectrum. As a case study, we analyse the POP protocol under the lens of whole-spectrum implementation

On duality relations for session types

Session types are a type formalism used to describe communication protocols over private session channels. Each participant in a binary session owns one endpoint of a session channel. A key notion is that of duality: the endpoints of a session channel should have dual session types in order to guarantee communication safety. Duality relations have been independently defined in different ways and different works, without considering their effect on the type system. In this paper we systematically study the existing duality relations and some new ones, and compare them in order to understand their expressiveness. The outcome is that those relations are split into two groups, one related to the na¨ıve inductive duality, and the other related to a notion of mutual compliance, which we borrow from the literature on contracts for web-services

Tools and verification

This chapter presents different tools that have been developed inside the Sensoria project. Sensoria studied qualitative analysis techniques for verifying properties of service implementations with respect to their formal specifications. The tools presented in this chapter have been developed to carry out the analysis in an automated, or semi-automated, way. We present four different tools, all developed during the Sensoria project, exploiting new techniques and calculi from the Sensoria project itself

A New Linear Logic for Deadlock-Free Session-Typed Processes

The π -calculus, viewed as a core concurrent programming language, has been used as the target of much research on type systems for concurrency. In this paper we propose a new type system for deadlock-free session-typed π -calculus processes, by integrating two separate lines of work. The first is the propositions-as-types approach by Caires and Pfenning, which provides a linear logic foundation for session types and guarantees deadlock-freedom by forbidding cyclic process connections. The second is Kobayashi’s approach in which types are annotated with priorities so that the type system can check whether or not processes contain genuine cyclic dependencies between communication operations. We combine these two techniques for the first time, and define a new and more expressive variant of classical linear logic with a proof assignment that gives a session type system with Kobayashi-style priorities. This can be seen in three ways: (i) as a new linear logic in which cyclic structures can be derived and a CYCLE -elimination theorem generalises CUT -elimination; (ii) as a logically-based session type system, which is more expressive than Caires and Pfenning’s; (iii) as a logical foundation for Kobayashi’s system, bringing it into the sphere of the propositions-as-types paradigm

On Asynchronous Session Semantics

This paper studies a behavioural theory of the π-calculus with session types under the fundamental principles of the practice of distributed computing — asynchronous communication which is order-preserving inside each connection (session), augmented with asynchronous inspection of events (message arrivals). A new theory of bisimulations is introduced, distinct from either standard asynchronous or synchronous bisimilarity, accurately capturing the semantic nature of session-based asynchronously communicating processes augmented with event primitives. The bisimilarity coincides with the reduction-closed barbed congruence. We examine its properties and compare them with existing semantics. Using the behavioural theory, we verify that the program transformation of multithreaded into event-driven session based processes, using Lauer-Needham duality, is type and semantic preserving

Drug Hypersensitivity Quality of Life Questionnaire: validation procedures and first results of the Portuguese version

Background: Hypersensitivity reactions to drugs are unpredictable and can be very complex and severe, even life threatening. Assess its impact on patient’s health related quality of life (HRQoL) is crucial. The Drug Hypersensitivity Quality of Life Questionnaire (DrHy-Q) is the only validated disease-specific HRQoL questionnaire. We aimed to translate and cross-cultural validate the DrHy-Q to the Portuguese population. It was also our purpose to determine the impact of drug hypersensitivity on patients’ HRQoL. Methods: The translation and cross-cultural adaptation of the DrHy-Q to Portuguese was performed according to standards. Reliability of the DrHy-Q Portuguese version was assessed in terms of internal consistency and test–retest reliability. Structural validity, divergent validity (with a generic health related QoLQ-PGWBI) and discriminant validity were also evaluated. Forty patients accepted to participate in the validation phase. The Portuguese version of the DrHy-Q was applied to 260 consecutively adult patients, studied in our Department for suspected drug hypersensitivity. Results: The Portuguese DrHy-Q showed adequate internal consistency (Cronbach’s ¿ = 0.938), good test–retest reliability [ICC = 0.713 (95% CI 0.488–0.850] and one-dimensional structure. No significant correlation was found between the DrHy-Q and the PGWBI total scores (r = - 0.010, p = 0.957). Two hundred of patients completed the study: 78.5% female; mean age = 44 ± 15 years. Mean DrHy-Q score was 36.8 ± 12.6. Two clinical factors significantly predict DrHy-Q total score: clinical manifestations and number of suspected drugs. Patients with anaphylaxis (ß = 11.005; 95% CI 5.523; 16.487), urticaria/angioedema (ß = 7.770; 95% CI 2.600; 12.940) and other manifestations (ß = 7.948; 95% CI 1.933; 13.962) are more likely to have higher DrHy-Q total score than patients with maculopapular exanthema. Patients with = 2 suspected drugs are also more likely to have worse QoL (ß = 7.927; 95% CI 3.687; 12.166). Conclusion: The Portuguese version of DrHy-Q revealed adequate validity and reliability, indicating that it is appropriate to assess the impact of drug hypersensitivity on patients’ HRQoL, providing data for a better comprehension and management of our patients. Moreover, our results highlight that the severity of the drug hypersensitivity reaction and the number of suspected drugs have impact on patient’s DrHy-QoL

On Global Types and Multi-Party Session

Global types are formal specifications that describe communication protocols in terms of their global interactions. We present a new, streamlined language of global types equipped with a trace-based semantics and whose features and restrictions are semantically justified. The multi-party sessions obtained projecting our global types enjoy a liveness property in addition to the traditional progress and are shown to be sound and complete with respect to the set of traces of the originating global type. Our notion of completeness is less demanding than the classical ones, allowing a multi-party session to leave out redundant traces from an underspecified global type. In addition to the technical content, we discuss some limitations of our language of global types and provide an extensive comparison with related specification languages adopted in different communities